Provably good mesh generation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Provably Good Mesh Generation

We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how to triangulate a point set in arbitrary dimension with simplices of bounded aspect ratio; and how ...

متن کامل

Tetrahedral Mesh Generation with Good Dihedral Angles

Tetrahedral Mesh Generation with Good Dihedral Angles Using Point Lattices by François Labelle Doctor of Philosophy in Computer Science University of California, Berkeley Professor Jonathan Shewchuk, Chair Three-dimensional meshes are frequently used to perform physical simulations in science and engineering. This involves decomposing a domain into a mesh of small elements, usually tetrahedra o...

متن کامل

Improved Mesh Generation: Not Simple but Good

An improved algorithm for two-dimensional triangular mesh generation in arbitrary polygonally bounded domains with holes and isolated interior points is presented. The algorithm is quad-tree based and follows the ideas of Bern, Eppstein and Gilbert 1]. Using a rhomboid structure of the quad-tree and a number of new ideas for warping and centering points and for shifting grids, we are able to ge...

متن کامل

Provably good moat routing

Moat routing is the routing of nets between the input/output pads and the core circuit. In this paper, it is proved that moat routing is NP-complete under the routing model in which there are no vertical con icts and doglegs are disallowed (i.e., every net is routed within a single track). This contrasts with the fact that channel routing is e ciently solvable under these restrictions. The pape...

متن کامل

Tetrahedral Mesh Generation with Good Dihedral Angles Using Point Lattices

Tetrahedral Mesh Generation with Good Dihedral Angles Using Point Lattices by François Labelle Doctor of Philosophy in Computer Science University of California, Berkeley Professor Jonathan Shewchuk, Chair Three-dimensional meshes are frequently used to perform physical simulations in science and engineering. This involves decomposing a domain into a mesh of small elements, usually tetrahedra o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1994

ISSN: 0022-0000

DOI: 10.1016/s0022-0000(05)80059-5